An Innovative Algorithmic Approach for Solving Profit Maximization Problems
نویسندگان
چکیده
منابع مشابه
An efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملan efficient approach for solving layout problems
this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...
متن کاملAlgorithmic Design for Competitive Influence Maximization Problems
Given the popularity of the viral marketing campaign in online social networks, finding an effective method to identify a set of most influential nodes so to compete well with other viral marketing competitors is of upmost importance. We propose a “General Competitive Independent Cascade (GCIC)” model to describe the general influence propagation of two competing sources in the same network. We...
متن کاملAn Algorithmic Approach for Solving ETSP Using Premium Solver Platform
Spreadsheet software, notably Microsoft Excel©, can be used very effectively for analyzing logistics and supply chain issues. Spreadsheet allow analysis from many different perspectives and can be modified and enhanced to reflect new situations and options. Our purpose in this article is to demonstrate the efficiency of a problemsolving algorithm that uses Microsoft Excel add-in tools Premium S...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics Letters
سال: 2018
ISSN: 2575-503X
DOI: 10.11648/j.ml.20180401.11